Complete graph

Results: 868



#Item
151NP-complete problems / Clique / Independent set / Graph / Network theory / Extremal graph theory / Matching

Inequality and network structure

Add to Reading List

Source URL: wkets.org

Language: English - Date: 2015-11-08 18:42:53
152Graph theory / Graph / Vertex / Planar graphs / Graph coloring / NP-complete problems

Subgraph Search Over Massive Disk Resident Graphs Peng Peng1, Lei Zou1, Lei Chen2, Xuemin Lin3, and Dongyan Zhao1,4 1Peking University, 2Hong Kong University of Science and Technology, 3University of New South Wales,

Add to Reading List

Source URL: ssdbm2011.ssdbm.org

Language: English - Date: 2011-09-01 19:29:54
153Graph theory / Graph coloring / NP-complete problems / Graph operations / Graph homomorphism / Morphisms / Bipartite graph / Graph / Core / Cycle / Matching / Bipartite double cover

Towards a Trichotomy for Quantified H-Coloring Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, DH1 3LE, U.K. Abstract. Hell and Neˇsetˇril proved that

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2009-11-10 10:57:00
154Graph connectivity / Computational complexity theory / Gadget / Graph / Cycle / Graph operations / Tree

Irreversible 2-conversion set is NP-complete ∗† Jan Kynˇcl, Bernard Lidick´ y, and Tom´aˇs Vyskoˇcil

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2009-12-01 17:03:48
155NP-complete problems / Graph operations / Graph coloring / Graph theory / Line graph / Clique / Chordal graph / Neighbourhood / Planar graph / Vertex / Triangle-free graph / Dominating set

tria-free-after-review14.dvi

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2012-04-30 01:42:59
156NP-complete problems / Graph coloring / Bipartite graph / Parity / Comparability graph / Matching / Trapezoid graph / Interval graph / Graph / Independent set / Interval edge coloring / Planar graph

The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-07-11 20:53:15
157Graph theory / Combinatorial optimization / NP-complete problems / Matching / Maximum cut / Clique / Graph / Cubic graph / Degree / Cut / Directed graph / Line graph

MAX CUT in cubic graphs Eran Halperin ∗ Dror Livnat

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2009-01-01 08:42:50
158Graph theory / Mathematics / NP-complete problems / NP-hard problems / Graph coloring / Routing algorithms / Search algorithms / Hamiltonian path / Bipartite graph / Travelling salesman problem / A* search algorithm / Planar separator theorem

DISCRETE APPLIED MATHEMATICS ELSEYIER Discrete Applied

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2010-06-13 16:41:26
159Graph theory / Mathematics / Routing algorithms / Edsger W. Dijkstra / NP-complete problems / Network theory / Geographic routing / Shortest path problem / Geometric spanner / Routing / Planar graph / Unit disk graph

Geometric Ad-Hoc Routing: Of Theory and Practice∗ Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger Department of Computer Science ETH Zurich 8092 Zurich, Switzerland {kuhn, wattenhofer, yzhang, zollinger}@inf

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:22
160Graph theory / Cluster graph / Matching / Clique / Ear decomposition / Neighbourhood / NP-complete problems / Line graph / Graph coloring

Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs∗ Iyad Kanj1 , Christian Komusiewicz2 , Manuel Sorge3 , and Erik Jan van Leeuwen4 1 2

Add to Reading List

Source URL: users.minet.uni-jena.de

Language: English
UPDATE